翻訳と辞書 Words near each other ・ Tokiwa Dam ・ Tokiwa Gozen ・ Tokiwa Jinja ・ Tokiwa Junior College ・ Tokiwa Kitareri ・ Tokiwa Station ・ Token bus network ・ Token coin ・ Token Creek, Wisconsin ・ Token economy ・ Token Homemate Cup ・ Token money ・ Token of Darkness ・ Token passing ・ Token Racing ・ Token reconfiguration ・ Token ring ・ Tokenism ・ Tokenization ・ Tokenization (data security) ・ Tokenization (lexical analysis) ・ Tokenzone ・ Toker ・ Toker Dam ・ Tokers Green ・ Tokerud School ・ Toketee Falls ・ Toketee State Airport ・ Tokey Banta ・ Tokey Hill Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Token reconfiguration ： ウィキペディア英語版 Token reconfiguration In computational complexity theory and combinatorics, the token reconfiguration problem is an optimization problem on a graph with both an initial and desired state for tokens. Given a graph $G$, an initial state of tokens is defined by a subset $V\; \backslash subset\; V(G)$ of the vertices of the graph; let $n\; =\; |V|$. Moving a token from vertex $v\_1$ to vertex $v\_2$ is valid if $v\_1$ and $v\_2$ are joined by a path in $G$ that does not contain any other tokens; note that the distance traveled within the graph is inconsequential, and moving a token across multiple edges sequentially is considered a single move. A desired end state is defined as another subset $V\text{'}\; \backslash subset\; V(G)$. The goal is to minimize the number of valid moves to reach the end state from the initial state. == Motivation == The problem is motivated by so-called sliding puzzles, which are in fact a variant of this problem, often restricted to rectangular grid graphs with no holes. The most famous such puzzle, the 15 puzzle, is a variant of this problem on a 4 by 4 grid graph such that $n\; =\; |V(G)|\; -\; 1$. One key difference between sliding block puzzles and the token reconfiguration problem is that in the original token reconfiguration problem, the tokens are indistinguishable. As a result, if the graph is connected, the token reconfiguration problem is always solvable; this is not necessarily the case for sliding block puzzles. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Token reconfiguration」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.